Usage refinement for ER-to-relation design transformations
نویسندگان
چکیده
Database schema refinement based on usage is proposed as a useful next step in a practical database design methodology founded upon entity-relationship (ER) conceptual modeling and transformation to normalized relations. A simple cost model is defined and applied to several examples and a case study, illustrating the important trade-offs among query and update costs, storage requirements, and degree of normalization with its data integrity implications.
منابع مشابه
Towards a Theory of Refinement for Data Migration
We develop a theoretical framework for refining transformations occurring in the process of data migration. A legacy kernel can be discovered at a high-level abstraction which consolidates heterogeneous data sources in a legacy system. We then show that migration transformations are specified via the composition of two subclasses of transformations: property-preserving transformations and prope...
متن کاملRestructuring of Relational Schemas
Schema restructuring is part of both database design and database reorganization, which are expressions of the specification and evolution of an information system. Entity-Relationship(ER) consistency expresses the capability of relational databases to model information oriented systems. A relational schema consistmg of relation schemes, together with key and inclusion dependencies, is said to ...
متن کاملInteraction design in service compositions
This thesis proposes a concept and transformations for designing interactions in a service composition at related abstraction levels. The concept and transformations are aimed at helping designers to bridge the conceptual gap between the business and software domains. In this way, the complexity of an interaction design can be managed adequately. A service composition is specified as one or mor...
متن کاملTranslation Validation for Transformations on Abstract Clocks in Synchronous Languages
Translation validation was introduced as a technique to formally verify the correctness of code generators that attempts to verify that program transformations preserve the semantics. In this work, we adopt this approach to formally verify that the clock semantics is preserved during the transformations of a synchronous data-flow compiler. We represent the clock semantics of a program and its t...
متن کاملSynchrony Loosening Transformations for Interacting Processes
In this paper we consider synchrony loosening transformations (SLTs) for mnltiparty interactions. Refinement has been applied to several subjects. For example: Data Refinement: Replacing abstract data by more efiieient concrete representation e.g. [23], [5], Action Refinement: Replacing a complex action by a combination of simpler actions (a common refinement), Atomiciiy Refinement: [6]. While ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 55 شماره
صفحات -
تاریخ انتشار 1991